On steady parallel flows
نویسندگان
چکیده
منابع مشابه
On steady-state intercompartmental flows.
The flow between compartments in physical and biological systems is treated as a special case of a more general theory of transitions between any two distinct sets A,A. Interest is focused on the flow rate from each set, i.e., the rate at which elements from that set appear in the other; and on the entry rate from each, i.e., the rate at which elements from the set leave to enter the region not...
متن کاملLarge-Scale Eigenvalue Calculations for Stability Analysis of Steady Flows on Massively Parallel Computers
We present an approach for determining the linear stability of steady-states of PDEs on massively parallel computers. Linearizing the transient behavior around a steady-state solution leads to an eigenvalue problem. The eigenvalues with largest real part are calculated using Arnoldi's iteration driven by a novel implementation of the Cayley transformation. The Cayley transformation requires the...
متن کاملNumerical Investigation on Contaminant Dispersion from a Source over the Blocks in Steady and Unsteady Flows
This paper deals with numerical study of semi-finite incompressible flow of air over two blocks with different heights in the presence of a condensing-source, dispensing- contaminant in the flow, in both steady and unsteady states. The numerical solution of governing PDE equations are constructed by a finite-volume method applied on structured grid arrangement. The effects of air flow velocity,...
متن کاملOn steady poloidal and toroidal flows in tokamak plasmas
The effects of poloidal and toroidal flows on tokamak plasma equilibria are examined in the magnetohydrodynamic limit. “Transonic” poloidal flows of the order of the sound speed multiplied by the ratio of poloidal magnetic field to total field B /B can cause the normally elliptic Grad– Shafranov GS equation to become hyperbolic in part of the solution domain. It is pointed out that the range of...
متن کاملEarliest arrival flows on series-parallel graphs
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1972
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90020-0